Recursive Contraction Algorithm: a Novel and Efficient Graph Traversal Method for Scanning All Minimal Cut Sets
نویسنده
چکیده
We propose a novel algorithm called RCA_MC, in which we use the breadth first search method (BFS) in conjunction with edge contraction and connectivity properties of a given undirected graph to enumerate and scan all its minimal edge cutsets. It is known that the problem of enumerating all minimal edge cutsets of a given graph is #P-complete. In addition, we introduce the concepts of pivot vertex and absorbable clusters, and use them to develop our enhanced recursive contraction for scanning all mimimal edge cutsets, called ERCA_MC, of a given graph. Simulation results provide empirical evidence that the complexity of the ERCA_MC algorithm is linear per cutset. Keywords– Breadth first search (BFS), cutset scanning, edge contraction, minimal edge cutset, #P-complete
منابع مشابه
A Novel and Efficient Algorithm for Scanning All Minimal Cutsets of a Graph
We propose a novel algorithm for enumerating and listing all minimal cutsets of a given graph. It is known that this problem is NP-hard. We use connectivity properties of a given graph to develop an algorithm with reduced complexity for finding all its cutsets. We use breadth first search (BFS) method in conjunction with edge contraction to develop the algorithm. We introduce the concepts of a ...
متن کاملSome Edge Cut Sets and an Upper bound for Edge Tenacity of Organic Compounds CnH2n+2
The graphs play an important role in our daily life. For example, the urban transport network can be represented by a graph, as the intersections are the vertices and the streets are the edges of the graph. Suppose that some edges of the graph are removed, the question arises, how damaged the graph is. There are some criteria for measuring the vulnerability of graph; the...
متن کاملAn Efficient Method based on Self-Generating Disjoint Minimal Cut-Sets for Evaluating Reliability Measures of Interconnection Networks
The reliability evaluation of interconnection networks is an important issue in their quality management. Some important reliability measures are network reliability or g-terminal reliability, terminal reliability or 2-terminal reliability and k-terminal reliability. This paper concentrates on evaluating these three different reliability measures of interconnection networks. In this context a n...
متن کاملUnder-Approximating Cut Sets for Reachability in Large Scale Automata Networks
In the scope of discrete finite-state models of interacting components, we present a novel algorithm for identifying sets of local states of components whose activity is necessary for the reachability of a given local state. If all the local states from such a set are disabled in the model, the concerned reachability is impossible. Those sets are referred to as cut sets and are computed from a ...
متن کاملCommunication-Efficient Parallel Multiway and Approximate Minimum Cut Computation
We examine diierent variants of minimum cut problems on undi-rected weighted graphs on the p-processor bulk synchronous parallel BSP model of Valiant. This model and the corresponding cost measure guide algorithm designers to develop work eecient algorithms that need only very little communication. Karger and Stein have presented a recursive contraction algorithm to solve minimum cut problems. ...
متن کامل